Defeasible logic versus Logic Programming without Negation as Failure
نویسندگان
چکیده
منابع مشابه
Defeasible Logic versus Logic Programming without Negation as Failure
A clash of intuitions: The current state of nonmonotonic multiple inheritance systems. 13 6 Conclusion We have looked at the relationship between four logic programming-based formalisms that employ a priority relation among rules and take a sceptical approach to inference. Three, defeasible logic, LPwNF and courteous logic programs, belong to the same \school" while priority logic takes a funda...
متن کاملDefeasible Logic versus Logic Programming without Negation as Failure
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. In this paper we compare the expressive power of two approaches in this family of logics: Defeasible Logic, and sceptical Logic Programming without ...
متن کاملHandling Exceptions in Logic Programming without Negation as Failure
Default rules, i.e. statements of the form normally a’s are b’s, are usually handled in Answer Set Programming by means of negation as failure which provides a way to capture exceptions to normal situations. In this paper we propose another approach which offers an operational counterpart to negation as failure, and which may be thought as a corresponding dual attitude. The approach amounts to ...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملAdding Negation-as-Failure to Intuitionistic Logic Programming
Intuitionistic logic programming is an extension of Horn-clause logic programming in which implications may appear “embedded” on the right-hand side of a rule. Thus, rules of the form A(x) ← [B(x) ← C(x)] are allowed. These rules are called embedded implications. In this paper, we develop a language in which negationas-failure is combined with embedded implications in a principled way. Although...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 2000
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(99)00060-6